The Number of Terms in the Permanent and the Determinant of a Generic Circulant Matrix
نویسندگان
چکیده
Let A = (aij) be the generic n×n circulant matrix given by aij = xi+j , with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is well-known and has several combinatorial interpretations. The function d(n), on the other hand, has not been studied previously. We show that when n is a prime power, d(n) = p(n). Introduction A square matrix is said to be a circulant matrix if its rows are successive cyclic permutations of the first row. Thus, the matrix A = (aij) with aij = xi+j , subscripts on x being interpreted mod n, is a generic circulant matrix. If we expand det(A), we obtain a polynomial in the xi. We define d(n) to be the number of terms in this polynomial after like terms have been combined. Similarly, we define p(n) to be the number of terms in per(A), the permanent of A. The function p(n) was studied in Brualdi and Newman [1], where it was pointed out that the main result of Hall [3] shows that p(n) coincides with the number of solutions to y1 + 2y2 + · · ·+ nyn ≡ 0 (mod n) y1 + · · ·+ yn = n (1) in non-negative integers. Using this formulation, they showed by a generating function argument that
منابع مشابه
Generalized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کاملHigher numerical ranges of matrix polynomials
Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملSome Results on the Field of Values of Matrix Polynomials
In this paper, the notions of pseudofield of values and joint pseudofield of values of matrix polynomials are introduced and some of their algebraic and geometrical properties are studied. Moreover, the relationship between the pseudofield of values of a matrix polynomial and the pseudofield of values of its companion linearization is stated, and then some properties of the augmented field of ...
متن کامل